RANKINGS GENERATED BY SPHERICAL DISCRIMINANT ANALYSIS

C∗-algebras generated by spherical hyperexpansions

Let T be a spherical completely hyperexpansive m-variable weighted shift on a complex, separable Hilbert space H and let T s denote its spherical Cauchy dual. We obtain the hyperexpansivity analog of the structure theorem of Olin–Thomson for the C∗-algebra C∗(T ) generated by T, under the natural assumption that T s is commuting. If, in addition, the defect operator I − T1T ∗ 1 − · · · − TmT ∗ ...

Spherical Discriminant Analysis in Semi-supervised Speaker Clustering

Semi-supervised speaker clustering refers to the use of our prior knowledge of speakers in general to assist the unsupervised speaker clustering process. In the form of an independent training set, the prior knowledge helps us learn a speaker-discriminative feature transformation, a universal speaker prior model, and a discriminative speaker subspace, or equivalently a speaker-discriminative di...

Buckling Analysis of Spherical Composite Panels Reinforced by Carbon Nanotube

In this study, the buckling behavior of moderately thick Carbon Nano-Tube (CNT)-reinforced spherical composite panels subjected to both uniaxial and biaxial loads is examined. The uniform and various kinds of functionally graded distributions of the CNT are considered. The mechanical properties of the nanocomposite panels are estimated using the modified rule of mixture. Based on the first-orde...

Spherical codes generated by binary partitions of symmetric pointsets

Recently, Ericson and Zinoviev presented a clever, new construction for spherical codes for the Gaussian channel using ideas of code concatenation and set partitioning. This family of new spherical codes is generated from sets of binary codes using equally spaced symmetric pointsets on the real line. The family contains some of the best known spherical codes in terms of minimum distance. Howeve...

Regression By Data Segments Via Discriminant Analysis